A New Dynamic Population Variation in Genetic Programming
نویسندگان
چکیده
A dynamic population variation (DPV) in genetic programming (GP) with four innovations is proposed for reducing computational effort and accelerating convergence during the run of GP. Firstly, we give a new stagnation phase definition and the characteristic measure for it. Secondly, we propose an exponential pivot function (EXP) in conjunction with the new stagnation phase definition. Thirdly, we propose an appropriate population variation formula for EXP. Finally, we introduce a scheme using an instruction matrix for producing new individuals to maintain diversity of the population. The efficacy of these innovations in our DPV is examined using four typical benchmark problems. Comparisons among the different characteristic measures have been conducted for regression problems and the proposed measure performed best in all characteristic measures. It is demonstrated that the proposed population variation scheme is superior to fixed and proportion64 Y. Tao, M. Li, J. Cao ate population variation schemes for sequence induction. It is proved that the new DPV has the capacity to provide solutions at a lower computational effort compared with previously proposed population variation methods and standard genetic programming in most problems.
منابع مشابه
Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach
In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملA green transportation location-inventory-routing problem by dynamic regional pricing
Non-uniform distribution of customers in a region and variation of their maximum willingness to pay at distinct areas make regional pricing a practical method to maximize the profit of the distribution system. By subtracting the classic objective function, which minimizes operational costs from revenue function, profit maximization is aimed. A distribution network is designed by determining the...
متن کاملA New Dynamic Random Fuzzy DEA Model to Predict Performance of Decision Making Units
Data envelopment analysis (DEA) is a methodology for measuring the relative efficiency of decision making units (DMUs) which ‎consume the same types of inputs and producing the same types of outputs. Believing that future planning and predicting the ‎efficiency are very important for DMUs, this paper first presents a new dynamic random fuzzy DEA model (DRF-DEA) with ‎common weights (using...
متن کاملNew Model for Visco-Elastic Behavior of Asphalt Mixture with Combined Effect of Stress and Temperature
The analysis of pavements and their ingredients has always been important due to a good understanding of their behavior under different conditions; that leads to more accurate relations. Due to the extent of asphalt mixture application in the world, the assessment of different behaviors of this mix is very important from various aspects of performance and safety. Given that the asphalt mixtures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing and Informatics
دوره 32 شماره
صفحات -
تاریخ انتشار 2013